Enumerative combinatorics on words
نویسنده
چکیده
HAL is a multi-disciplinary open access archive for the deposit and dissemination of scientific research documents, whether they are published or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers. L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des établissements d’enseignement et de recherche français ou étrangers, des laboratoires publics ou privés. Enumerative combinatorics on words Dominique Perrin
منابع مشابه
Bijective Combinatorics of Reduced Decompositions
We study the bijective combinatorics of reduced words. These are fundamental objects in the study of Coxeter groups. We restrict our focus to reduced words of permutations and signed permutations. Our results can all be situated within the context of two parallels. The first parallel is between the enumerative theory of reduced words and that of Coxeter group elements. The second parallel is be...
متن کاملBULLETIN (New Series) OF THE AMERICAN MATHEMATICAL SOCIETY
The fundamental problem of enumerative combinatorics is to determine the number of elements of a set. More precisely, given an infinite indexed collection {Ai}i∈I of finite sets, we want to find a formula for the cardinality of Ai as a function of i, or at least a method for determining the number of elements of Ai that is easier (or more interesting) than counting them one at a time. There are...
متن کاملRecent Advances in Algebraic and Enumerative Combinatorics
Algebraic and enumerative combinatorics is concerned with objects that have both a combinatorial and an algebraic interpretation. It is a highly active area of the mathematical sciences, with many connections and applications to other areas, including algebraic geometry, representation theory, topology, mathematical physics and statistical mechanics. Enumerative questions arise in the mathemati...
متن کاملComplexity problems in enumerative combinatorics
We give a broad survey of recent results in Enumerative Combinatorics and their complexity aspects.
متن کاملMathematisches Forschungsinstitut Oberwolfach Report No
Enumerative Combinatorics focusses on the exact and asymptotic counting of combinatorial objects. It is strongly connected to the probabilistic analysis of large combinatorial structures and has fruitful connections to several disciplines, including statistical physics, algebraic combinatorics, graph theory and computer science. This workshop brought together experts from all these various fiel...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2017